On Smarandachely Harmonic Graphs
نویسنده
چکیده
A graph G is said to be Smarandachely harmonic graph with property P if its vertices can be labeled 1, 2, · · · , n such that the function fP : A → Q defined by fp(H) = ∏ v∈V (H) f(v) ∑ v∈V (H) f(v) , H ∈ A is injective. Particularly, if A is the collection of all paths of length 1 in G (That is, A = E(G)), then a Smarandachely harmonic graph is called Strongly harmonic graph. In this paper we show that all cycles, wheels, trees and grids are strongly harmonic graphs. Also we give an upper bound and a lower bound for μ(n), the maximum number of edges in a strongly harmonic graph of order n.
منابع مشابه
Some Results on Super Mean Graphs
Let G be a graph and f : V (G) → {1, 2, 3, . . . , p+ q} be an injection. For each edge e = uv and an integer m ≥ 2, the induced Smarandachely edge m-labeling f∗ S is defined by f ∗ S(e) = ⌈ f(u) + f(v) m ⌉ . Then f is called a Smarandachely super m-mean labeling if f(V (G))∪ {f∗(e) : e ∈ E(G)} = {1, 2, 3, . . . , p+ q}. Particularly, in the case of m = 2, we know that f ∗(e) = f(u)+f(v) ...
متن کاملOn Near Mean Graphs
A graph that admits a Smarandachely near mean m-labeling is called Smarandachely near m-mean graph. The graph that admits a near mean labeling is called a near mean graph (NMG). In this paper, we proved that the graphs Pn, Cn,K2,n are near mean graphs and Kn(n > 4) and K1,n(n > 4) are not near mean graphs.
متن کاملTriple Connected Domination Number of a Graph
The concept of triple connected graphs with real life application was introduced in [7] by considering the existence of a path containing any three vertices of a graph G. In this paper, we introduce a new domination parameter, called Smarandachely triple connected domination number of a graph. A subset S of V of a nontrivial graph G is said to be Smarandachely triple connected dominating set, i...
متن کاملLabeling, Covering and Decomposing of Graphs — Smarandache’s Notion in Graph Theory
This paper surveys the applications of Smarandache’s notion to graph theory appeared in International J.Math.Combin. from Vol.1,2008 to Vol.3,2009. In fact, many problems discussed in these papers are generalized in this paper. Topics covered in this paper include: (1)What is a Smarandache System? (2)Vertex-Edge Labeled Graphs with Applications: (i)Smarandachely k-constrained labeling of a grap...
متن کاملThe H - Line Signed Graph of a Signed Graph
A Smarandachely k-signed graph (Smarandachely k-marked graph) is an ordered pair S = (G,σ) (S = (G,μ)) where G = (V, E) is a graph called underlying graph of S and σ : E → (e1, e2, ..., ek) (μ : V → (e1, e2, ..., ek)) is a function, where each ei ∈ {+,−}. Particularly, a Smarandachely 2-signed graph or Smarandachely 2-marked graph is called abbreviated a signed graph or a marked graph. Given a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013